MDS codes over finite principal ideal rings
نویسندگان
چکیده
The purpose of this paper is to study codes over finite principal ideal rings. To do this, we begin with codes over finite chain rings as a natural generalization of codes over Galois rings GR(pe, l) (including Zpe). We give sufficient conditions on the existence of MDS codes over finite chain rings and on the existence of self-dual codes over finite chain rings. We also construct MDS self-dual codes over Galois rings GF (2e, l) of length n = 2l for any a ≥ 1 and l ≥ 2. Torsion codes over residue fields of finite chain rings are introduced, and some of their properties are derived. Finally, we describe MDS codes and self-dual codes over finite principal ideal rings by examining codes over their component chain rings, via a generalized Chinese remainder theorem.
منابع مشابه
MDS and self-dual codes over rings
In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the construction of infinite families of MDS self-dual codes over finite chain rings, formal power series and principal ideal rings.
متن کاملConstructions of self-dual codes over finite commutative chain rings
We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element c with c = −1 all self-dual codes can be constructed by this technique. We extend this construction to self-dual codes over principal ideal rings via the Chinese Remainder Theorem. We use torsion codes to describe the...
متن کاملConstacyclic Codes over Finite Principal Ideal Rings
In this paper, we give an important isomorphism between contacyclic codes and cyclic codes,over finite principal ideal rings.Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal ideal rings are given.
متن کاملHomogeneous weights of matrix product codes over finite principal ideal rings
In this paper, the homogeneous weights of matrix product codes over finite principal ideal rings are studied and a lower bound for the minimum homogeneous weights of such matrix product codes is obtained.
متن کاملMultivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over $\mathbb{F}_4$
In this work, we study the structure of multivariable modular codes over finite chain rings when the ambient space is a principal ideal ring. We also provide some applications to additive modular codes over the finite field $\mathbb{F}_4$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 50 شماره
صفحات -
تاریخ انتشار 2009